A preconditioning technique for Schur complement systems arising in stochastic optimization

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A preconditioning technique for Schur complement systems arising in stochastic optimization

Deterministic sample average approximations of stochastic programming problems with recourse are suitable for a scenario-based parallelization. In this paper the parallelization is obtained by using an interior-point method and a Schur complement mechanism for the interior-point linear systems. However, the direct linear solves involving the dense Schur complement matrix are expensive, and adve...

متن کامل

On Preconditioning Schur Complement and Schur Complement Preconditioning

We study two implementation strategies to utilize Schur complement technique in multilevel recursive incomplete LU preconditioning techniques (RILUM) for solving general sparse matrices. The first strategy constructs a RILUM to precondition the original matrix. The second strategy solves the first Schur complement matrix using the lower level parts of the RILUM as the preconditioner. We discuss...

متن کامل

Schur complement preconditioning for elliptic systems of partial differential equations

S hur omplement pre onditioning for ellipti systems of partial di erential equations D. Loghin and A. J. Wathen One su essful approa h in the design of solution methods for saddle-point problems requires the eÆ ient solution of the asso iated S hur omplement problem ([26℄, [19℄). In the ase of problems arising from partial di erential equations the fa torization of the symbol of the operator an...

متن کامل

On Inertia and Schur Complement in Optimization

Partitioned symmetric matrices, in particular the Hessian of the Lagrangian, play a fundamental role in nonlinear optimization. For this type of matrices S.-P. Han and 0. Fujiwara recently presented an inertia theorem under a certain regularity assumption. We prove that this theorem is true without any regularity assumption. Then we consider matrix extensions preserving the sign of the determin...

متن کامل

An Augmented Incomplete Factorization Approach for Computing the Schur Complement in Stochastic Optimization

We present a scalable approach and implementation for solving stochastic optimization problems on high-performance computers. In this work we revisit the sparse linear algebra computations of the parallel solver PIPS with the goal of improving the shared-memory performance and decreasing the time to solution. These computations consist of solving sparse linear systems with multiple sparse right...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Optimization and Applications

سال: 2011

ISSN: 0926-6003,1573-2894

DOI: 10.1007/s10589-011-9418-y